Fast Running Tracks
نویسندگان
چکیده
منابع مشابه
Fast Algorithms for Running Wavelet Analyses
We present a general framework for the design and efficient implementation of various types of running (or over-sampled) wavelet transforms (RWT) using polynomial splines. Unlike previous techniques, the proposed algorithms are not necessarily restricted to scales that are powers of two; yet they all achieve the lowest possible complexity : 0(N) per scale, where N is signal length. In particula...
متن کاملFast Computation of a Class of Running
The paper focuses on the computation of a class of running lters deened as the n-ary extension of an associative, commutative and idempotent binary operation T on an ordered sequence of operands. The well-known max/min lters are the prominent representatives of the class. For any arbitrary window lter of size n, the existence of a fast algorithm of complexity O(log 2 n) T-operations is proven. ...
متن کاملOn Fast Running Max-Min Filtering
The problem of fast running max/min lters for arbitrary-size windows is addressed. The size of the lter window is increased to the least power of two greater than the given size and the input sequence is expanded. The running max/min computation uses a fast algorithm for power of two window sizes, as described in 1]. The computational complexity (comparisons per sample) of the proposed algorith...
متن کاملTripartite Line Tracks - Bipartite Line Tracks
Theories of shapes are important for object recognition and for reasoning about the behaviour of objects, both tasks strongly constrained by shape. Whereas the extraction of shape properties has extensively been studied in vision, there is still a lack of qualitative shape descriptions which allow reasoning about shapes with AI techniques in a flexible manner. In this paper we present a qualita...
متن کاملSearching tracks
Search theory is the discipline that studies the problem of how best to search for an object when the amount of searching efforts is limited and only probabilities of the possible position of the object are given. Then, the problem is to find the optimal distribution of this total effort that maximizes the probability of detection. Although the general formalism of search theory will be used su...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Scientific American
سال: 1978
ISSN: 0036-8733
DOI: 10.1038/scientificamerican1278-148